Paths through inverse limits
نویسندگان
چکیده
منابع مشابه
Exactness of Inverse Limits
THEOREM I. Let X be a small category. Then the following assertions are equivalent: (1) The inverse limit proj limx: AB-^AB is exact (2) For every abelian category SÏ with exact direct products y the inverse limit proj lim* : %—»3I is exact. (3) Every connected component Y of X contains an object y together with an endomorphism eÇz Y (y, y) such that the following properties are satisfied: (i) ...
متن کاملInverse Limits of Solvable Groups
In this paper we generalize to groups of Galois type some results of P. Hall on finite solvable groups [l; 2; 3]. We need, in a modified form, some results of van Dantzig: the definition of supernatural numbers (which are related to van Dantzig's universal numbers) and Theorem 5, which he proved for ordinary ¿>-Sylow subgroups [6]. Lemmas 1 and 4 and the method of proof in Theorem 5 are due to ...
متن کاملTiling Spaces Are Inverse Limits
Let M be an arbitrary Riemannian homogeneous space, and let Ω be a space of tilings of M , with finite local complexity (relative to some symmetry group Γ) and closed in the natural topology. Then Ω is the inverse limit of a sequence of compact finite-dimensional branched manifolds. The branched manifolds are (finite) unions of cells, constructed from the tiles themselves and the group Γ. This ...
متن کاملInverse Limits and Profinite Groups
Standard examples of inverse limits arise from sequences of groups, with maps between them: for instance, if we have the sequence Gn = Z/pZ for n ≥ 0, with the natural quotient maps πn+1 : Gn+1 → Gn, the inverse limit consists of tuples (g0, g1, . . . ) ∈ ∏ n≥0Gn such that πn+1(gn+1) = gn for all n ≥ 0. This is a description of the p-adic integers Zp. It is clear that more generally if the Gn a...
متن کاملOn the Inverse Shortest Paths Problem
In this paper we survey a variant of the inverse shortest paths problem. Given is a network in which certain node-pairs require connections over specific predefined single paths. The aim is to find link weights such that the desired paths are uniquely induced by a shortest-path algorithm. Further we require that the link weights fit existing shortest-path based routing protocols. We give a moti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2011
ISSN: 0166-8641
DOI: 10.1016/j.topol.2011.03.001